/*
 * Atomic Predicates for Transformers
 * 
 * Copyright (c) 2015 UNIVERSITY OF TEXAS AUSTIN. All rights reserved. Developed
 * by: HONGKUN YANG and SIMON S. LAM http://www.cs.utexas.edu/users/lam/NRL/
 * 
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * with the Software without restriction, including without limitation the
 * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
 * sell copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 * 
 * 1. Redistributions of source code must retain the above copyright notice,
 * this list of conditions and the following disclaimers.
 * 
 * 2. Redistributions in binary form must reproduce the above copyright notice,
 * this list of conditions and the following disclaimers in the documentation
 * and/or other materials provided with the distribution.
 * 
 * 3. Neither the name of the UNIVERSITY OF TEXAS AUSTIN nor the names of the
 * developers may be used to endorse or promote products derived from this
 * Software without specific prior written permission.
 * 
 * 4. Any report or paper describing results derived from using any part of this
 * Software must cite the following publication of the developers: Hongkun Yang
 * and Simon S. Lam, Scalable Verification of Networks With Packet Transformers
 * Using Atomic Predicates, IEEE/ACM Transactions on Networking, October 2017,
 * Volume 25, No. 5, pages 2900-2915 (first published as IEEE Early Access
 * Article, July 2017, Digital Object Identifier: 10.1109/TNET.2017.2720172).
 * 
 * 
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * CONTRIBUTORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS WITH
 * THE SOFTWARE.
 */
package transformer;

import java.io.*;
import java.util.*;

import common.PositionTuple;

public class StateTransfoerI26Run {


	/**
	 * 
	 * @param args - 1,2,3
	 * @throws IOException
	 */
	public static void main(String[] args) throws IOException
	{
		Network n = new Network("i2", false, true);
		Device.only_v6 = true;
		StateTransfer stfer = new StateTransfer(n);
		Set<PositionTuple> pts = n.getallactiveports();
		System.out.println(pts.size() + " ports in total");

		StateUtility su = new StateUtility();

		for(PositionTuple pt1 : pts)
		{
			long t1 = System.nanoTime();
			StateBDD hs = stfer.TraverseAnyPkt(pt1);
			long t2 = System.nanoTime();
			System.out.println((t2-t1)/1000000.0);
			su.add_state(hs);
			//hs.printState();
		}

		//su.show_heights();
		//su.show_num_leaves();

		System.out.println("average heights:" + su.get_ave_height());
		double [] height_order = su.get_order_height();
		System.out.println("median heights:" + height_order[1]);
		System.out.println("max heights:" + height_order[2]);

		System.out.println("average num of leaves:" + su.get_ave_num_leaves());
		double [] leave_order = su.get_order_leaves();
		System.out.println("median of leaves:" + leave_order[1]);
		System.out.println("max leaves:" + leave_order[2]);



	}
}


